Application of the Strictly Contractive Peaceman-Rachford Splitting Method to Multi-block Separable Convex Programming

نویسندگان

  • Bingsheng He
  • Han Liu
  • Juwei Lu
  • Xiaoming Yuan
چکیده

Recently, a strictly contractive Peaceman-Rachford splitting method (SCPRSM) was proposed to solve a convex minimization model with linear constraints and a separable objective function which is the sum of two functionals without coupled variables. We show by an example that the SC-PRSM cannot be directly extended to the case where the objective function is the sum of three or more functionals. To solve such a multi-block model, if we treat its variables and functions as two groups and directly apply the SC-PRSM, then at least one of SC-PRSM subproblems involves more than one function and variable which might not be easy to solve. One way to improve the solvability for this direct application of the SC-PRSM is to further decompose such a subproblem so as to generate easier decomposed subproblems which could potentially be simple enough to have closed-form solutions for some specific applications. The curse accompanying this improvement in solvability is that the SC-PRSM with further decomposed subproblems is not necessarily convergent, either. We will show its divergence by the same example. Our main goal in this chapter is to show that the convergence can be guaranteed if the further deBingsheng He International Centre of Management Science and Engineering, School of Management and Engineering, and Department of Mathematics, Nanjing University, Nanjing, 200093, China, e-mail: [email protected]. This author was supported by the NSFC grant 91130007 and the MOEC fund 20110091110004., Han Liu Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ 08544, USA, e-mail: [email protected]. This author was supported by NSF Grant III–1116730. Juwei Lu Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ 08544, USA, e-mail: [email protected] Xiaoming Yuan Department of Mathematics, Hong Kong Baptist University, Hong Kong, e-mail: xmyuan@ hkbu.edu.hk. This author was supported by the General Research Fund from Research Grants Council of Hong Kong: 12302514.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Strictly Contractive Peaceman-Rachford Splitting Method for Convex Programming

In this paper, we focus on the application of the Peaceman-Rachford splitting method (PRSM) to a convex minimization model with linear constraints and a separable objective function. Compared to the Douglas-Rachford splitting method (DRSM), another splitting method from which the alternating direction method of multipliers originates, PRSM requires more restrictive assumptions to ensure its con...

متن کامل

A semi-proximal-based strictly contractive Peaceman-Rachford splitting method∗

The Peaceman-Rachford splitting method is very efficient for minimizing sum of two functions each depends on its variable, and the constraint is a linear equality. However, its convergence was not guaranteed without extra requirements. Very recently, He et al. (SIAM J. Optim. 24: 1011 1040, 2014) proved the convergence of a strictly contractive Peaceman-Rachford splitting method by employing a ...

متن کامل

Block-wise Alternating Direction Method of Multipliers for Multiple-block Convex Programming and Beyond

The alternating direction method of multipliers (ADMM) is a benchmark for solving a linearly constrained convex minimization model with a two-block separable objective function; and it has been shown that its direct extension to a multiple-block case where the objective function is the sum of more than two functions is not necessarily convergent. For the multipleblock case, a natural idea is to...

متن کامل

Convergence analysis of the Peaceman-Rachford splitting method for nonsmooth convex optimization

In this paper, we focus on the convergence analysis for the application of the PeacemanRachford splitting method to a convex minimization model whose objective function is the sum of a smooth and nonsmooth convex functions. The sublinear convergence rate in term of the worst-case O(1/t) iteration complexity is established if the gradient of the smooth objective function is assumed to be Lipschi...

متن کامل

Stochastic Strictly Contractive Peaceman-Rachford Splitting Method

In this paper, we propose a couple of new Stochastic Strictly Contractive PeacemanRachford Splitting Method (SCPRSM), called Stochastic SCPRSM (SS-PRSM) and Stochastic Conjugate Gradient SCPRSM (SCG-PRSM) for large-scale optimization problems. The two types of Stochastic PRSM algorithms respectively incorporate stochastic variance reduced gradient (SVRG) and conjugate gradient method. Stochasti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014